Lossless Join Decomposition for Extended Possibility-Based Fuzzy Relational Databases
نویسندگان
چکیده
منابع مشابه
Fuzzy Join Dependency in Fuzzy Relational Databases
The join dependency provides the basis for obtaining lossless join decomposition in a classical relational schema. The existence of Join dependency shows that that the tables always represent the correct data after being joined. Since the classical relational databases cannot handle imprecise data, they were extended to fuzzy relational databases so that uncertain, ambiguous, imprecise and part...
متن کاملLossless Join Decomposition Avoid Inconsistency in Fuzzy Relational Database for Perfect Operation
Fuzzy relational database handle imprecise information on database to maintain integrity of operation. Already I handled different normal form to reduce redundancy of data in a database. Decomposition of a relation should not be arbitrary either by tuples or attributes of a relation. In this paper, I have focused on lossless decomposition of third or Boyce Codd normal form based relation so tha...
متن کاملLossless Semantic Compression for Relational Databases
........................................................................................................................ iii Acknowledgements ........................................................................................................iv Dedication .......................................................................................................................v List of Tables.....
متن کاملAn Approach for Normalizing Fuzzy Relational Databases Based on Join Dependency
Fuzziness in databases is used to denote uncertain or incomplete data. Relational Databases stress on the nature of the data to be certain. This certainty based data is used as the basis of the normalization approach designed for traditional relational databases. But real world data may not always be certain, thereby making it necessary to design an approach for normalization that deals with fu...
متن کاملMultiple Path Join for Nested Relational Databases
This paper presents a solution to the problem of how to eeciently process queries which include join operations in the nested relational model. We focus on the join operation, and introduce a new join operator called P-join. The P-join operator merges two scheme trees. It combines the advantages of the extended natural join and recursive join for eecient data access. The algebraic expression of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/842680